Two constructions of H-antimagic graphs
نویسندگان
چکیده
منابع مشابه
Constructions of antimagic labelings for some families of regular graphs
In this paper we construct antimagic labelings of the regular complete multipartite graphs and we also extend the construction to some families of regular graphs.
متن کاملconstructions of antimagic labelings for some families of regular graphs
in this paper we construct antimagic labelings of the regular complete multipartite graphs and we also extend the construction to some families of regular graphs.
متن کاملNew Constructions of Antimagic Graph Labeling
An anti-magic labeling of a finite simple undirected graph with p vertices and q edges is a bijection from the set of edges to the set of integers {1, 2, ..., q} such that the vertex sums are pairwise distinct, where the vertex sum at vertex u is the sum of labels of all edges incident to such vertex. A graph is called anti-magic if it admits an antimagic labeling. Hartsfield and Ringel conject...
متن کاملSuper ( , - Edge - Antimagic Graphs
A graph G of order p and size q is called (a,d)-edge-antimagic total if there exists a one-to-one and onto mapping f from ∪ , ,... , such that the edge weights , ∈ form an AP progression with first term ’a’ and common difference ’d’. The graph G is said to be Super (a,d)-edge-antimagic total labeling if the , , ... , . In this paper we obtain Super (a,d)-edge-antimagic properties of certain cla...
متن کاملRegular Graphs are Antimagic
In this note we prove with a slight modification of an argument of Cranston et al. [2] that k-regular graphs are antimagic for k ≥ 2.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: AKCE International Journal of Graphs and Combinatorics
سال: 2017
ISSN: 0972-8600,2543-3474
DOI: 10.1016/j.akcej.2016.11.004